A Computational Model of Tractable Reasoning
نویسنده
چکیده
Polynomial time complexity is the usuaìthreshold' for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in the context of knowledge representation and reasoning. It is argued that doing so may be inappropriate in the context of common sense reasoning underlying language understanding. A more stringent criteria of tractability is proposed. A result about reasoning that is tractable in this stronger sense is outlined. Some unusual properties of tractable reasoning emerge when the formal speciication is grounded in a neurally plausible architecture.
منابع مشابه
Computational Complexity of Point Algebras for Nonlinear Time
E cient reasoning about temporal constraints over nonlinear time models is vital in numerous application areas, such as planning, distributed systems and cooperating agents. We give a total classi cation of tractable classes for the point algebra over partially ordered time and examine one large tractable subclass of the point algebra over branching time.
متن کاملComputational Complexity of Terminological Reasoning in BACK Published in Arti cial Intelligence
Terminological reasoning is a mode of reasoning all hybrid knowledge representation systems based on KL ONE rely on After a short introduc tion of what terminological reasoning amounts to it is proven that a com plete inference algorithm for the BACK system would be computationally intractable Interestingly this result also applies to the KANDOR system which had been conjectured to realize comp...
متن کاملTractable Meta-Reasoning in Propositional Logics of Belief
Finding adequate semantic models of deductive reasoning is a difficult problem, if deductions are to be performed efficiently and in a semantically appropriate way. The model of reasoning provided by possible-worlds semantics has been found deficient both for computational and intuitive reasons. Existing semantic approaches that were proposed as alternatives to possible-worlds semantics either ...
متن کاملA Study in the Computational Complexity of Temporal Reasoning
Reasoning about temporal and spatial information is a common task in computer science, especially in the field of artificial intelligence. The topic of this thesis is the study of such reasoning from a computational perspective. We study a number of different qualitative point based formalisms for temporal reasoning and provide a complete classification of computational tractability for differe...
متن کاملAutomata-Based Abduction for Tractable Diagnosis
Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its inherent computational complexity. This paper presents a novel, tractable abduction procedure for the lightweight description logic EL. The proposed approach extends recent research on automata-based axiom pinpointing (which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993